Local indicability and relative presentations of groups
نویسندگان
چکیده
منابع مشابه
Local indicability and commutator subgroups of Artin groups
Artin groups (also known as Artin-Tits groups) are generalizations of Artin’s braid groups. This paper concerns Artin groups of spherical type, that is, those whose corresponding Coxeter group is finite, as is the case for the braid groups. We compute presentations for the commutator subgroups of the irreducible spherical-type Artin groups, generalizing the work of Gorin and Lin [GL69] on the b...
متن کاملSemigroup presentations for test local groups
In this paper we exhibit a type of semigroup presentations which determines a class of local groups. We show that the finite elements of this class generate the pseudovariety LG of all finite local groups and use them as test-semigroups to prove that LG and S, the pseudovariety of all finite semigroups, verify the same κ-identities involving κ-terms of rank at most 1, where κ denotes the implic...
متن کاملcommuting and non -commuting graphs of finit groups
فرض کنیمg یک گروه غیر آبلی متناهی باشد . گراف جابجایی g که با نماد نمایش داده می شود ،گرافی است ساده با مجموعه رئوس که در آن دو راس با یک یال به هم وصل می شوند اگر و تنها اگر . مکمل گراف جابجایی g راگراف نا جابجایی g می نامیم.و با نماد نشان می دهیم. گرافهای جابجایی و ناجابجایی یک گروه متناهی ،اولین بار توسطاردوش1 مطرح گردید ،ولی در سالهای اخیر به طور مفصل در مورد بحث و بررسی قرار گرفتند . در ،م...
15 صفحه اولNILPOTENCY AND SOLUBILITY OF GROUPS RELATIVE TO AN AUTOMORPHISM
In this paper we introduce the concept of α-commutator which its definition is based on generalized conjugate classes. With this notion, α-nilpotent groups, α-solvable groups, nilpotency and solvability of groups related to the automorphism are defined. N(G) and S(G) are the set of all nilpotency classes and the set of all solvability classes for the group G with respect to different automorphi...
متن کاملLexical Presentations of Groups
Using elementary ideas from formal language theory we introduce a kind of group presentation which makes solution of the word problem easy in the case of a nite group, and which in that case also makes possible an eecient algorithm to compute a traversal, i.e., a list of strings in generators in which each group element occurs exactly once.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Pure and Applied Algebra
سال: 2003
ISSN: 0022-4049
DOI: 10.1016/s0022-4049(02)00144-5